A Multi-Robot Path Planning Method under Narrow Environments
نویسندگان
چکیده
منابع مشابه
A Mobile Robot Path-planning Approach under Unknown Environments
An inverse D* algorithm is presented in this paper for path-planning under unknown environments. In this inverse D* algorithm, the local potential energy around the current position is created firstly by defining the robot distance, then the leave point is searched to be regarded as the local goal position satisfying requirement of the rolling optimization. The leave point is searched locally a...
متن کاملCooperative Multi-Robot Path Planning
In risky applications it is advantageous to use multiple robots in order to improve performances. In a research or patrol scenario robots have to move cooperatively in order to avoid collisions and to improve performance. In this paper we describe the implementation of two variations of a cooperative planning algorithm: Cooperative A* and Cooperative Voronoi A*. The task is decoupled into a ser...
متن کاملMulti Robot Path Planning Algorithms: a Survey
To find the optimal path by interacting with multiple robots is the main research area in field of robotics. The task is to find the global optimal path with a minimum amount of computation time. Path planning has numerous application like industrial robotics, to design autonomous system etc. In this paper, we survey on three most recent algorithms namely Bacteria forging Optimization (BFO), An...
متن کاملAny-Com Multi-robot Path-Planning with Dynamic Teams: Multi-robot Coordination under Communication Constraints
We are interested in finding solutions to the multi-robot path-planning problem that have guarantees on completeness, are robust to communication failure, and incorporate varying team size. In this paper we present an algorithm that addresses the complete multi-robot path-planning problem from two different angles. First, dynamic teams are used to minimize computational complexity per robot and...
متن کاملMulti-Robot Path-Planning with Subgraphs
In this paper we consider the problem of planning paths for an homogeneous group of robots around a shared roadmap. We show that significant speedup can be achieved if we decompose the roadmap into subgraphs of known structure, such as stacks and cliques, and build plans hierarchically, first between connected subgraphs, then inside the subgraphs. We show that this approach while suboptimal is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence and Robotics Research
سال: 2015
ISSN: 2326-3415,2326-3423
DOI: 10.12677/airr.2015.42002